Vector lattices of self-adjoint operators

Diagonals of Self-adjoint Operators

The eigenvalues of a self-adjoint n×n matrix A can be put into a decreasing sequence λ = (λ1, . . . , λn), with repetitions according to multiplicity, and the diagonal of A is a point of R that bears some relation to λ. The Schur-Horn theorem characterizes that relation in terms of a system of linear inequalities. We prove an extension of the latter result for positive trace-class operators on ...

Non-self-adjoint Differential Operators

We describe methods which have been used to analyze the spectrum of non-self-adjoint differential operators, emphasizing the differences from the self-adjoint theory. We find that even in cases in which the eigenfunctions can be determined explicitly, they often do not form a basis; this is closely related to a high degree of instability of the eigenvalues under small perturbations of the opera...

Adjoints and Self-Adjoint Operators

Let V and W be real or complex finite dimensional vector spaces with inner products 〈·, ·〉V and 〈·, ·〉W , respectively. Let L : V → W be linear. If there is a transformation L∗ : W → V for which 〈Lv,w〉W = 〈v, Lw〉V (1) holds for every pair of vectors v ∈ V and w in W , then L∗ is said to be the adjoint of L. Some of the properties of L∗ are listed below. Proposition 1.1. Let L : V →W be linear. ...

An equivalence functor between local vector lattices and vector lattices

We call a local vector lattice any vector lattice with a distinguished positive strong unit and having exactly one maximal ideal (its radical). We provide a short study of local vector lattices. In this regards, some characterizations of local vector lattices are given. For instance, we prove that a vector lattice with a distinguished strong unit is local if and only if it is clean with non no-...

On Families of Self Adjoint Operators